High-resolution wide-band fast Fourier transform spectrometers
نویسندگان
چکیده
منابع مشابه
High Performance Sparse Fast Fourier Transform
The Sparse Fast Fourier Transform is a recent algorithm developed by Hassanieh et al. at MIT for Discrete Fourier Transforms on signals with a sparse frequency domain. A reference implementation of the algorithm exists and proves that the Sparse Fast Fourier Transform can be faster than modern FFT libraries. However, the reference implementation does not take advantage of modern hardware featur...
متن کاملWide-field, high-resolution Fourier ptychographic microscopy
In this article, we report an imaging method, termed Fourier ptychographic microscopy (FPM), which iteratively stitches together a number of variably illuminated, low-resolution intensity images in Fourier space to produce a wide-field, high-resolution complex sample image. By adopting a wavefront correction strategy, the FPM method can also correct for aberrations and digitally extend a micros...
متن کاملWide Band, High Resolution Sonar Techniques
Recent developments in the use of composite ceramics for high frequency arrays have reached the stage where large area, high frequency sonar receiver arrays can be produced cost effectively [1]. Typically these consist of hundreds of individual sensors with excellent element-to-element matching, in both gain and phase, over bandwidths in excess of an octave centred on frequencies in the range 3...
متن کاملA Multi-Resolution Texture Image Retrieval Using Fast Fourier Transform
Texture is an important visual property that characterizes a wide range of natural and artificial images which makes it a useful feature for retrieving images. Several approaches have been proposed to describe the texture contents of an image. In early research works, such as edge histograms-based techniques and co-occurrence-based approaches, texture descriptors were mainly extracted from the ...
متن کاملInteger fast Fourier transform
In this paper, a concept of integer fast Fourier transform (IntFFT) for approximating the discrete Fourier transform is introduced. Unlike the fixed-point fast Fourier transform (FxpFFT), the new transform has the properties that it is an integer-to-integer mapping, is power adaptable and is reversible. The lifting scheme is used to approximate complex multiplications appearing in the FFT latti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Astronomy & Astrophysics
سال: 2012
ISSN: 0004-6361,1432-0746
DOI: 10.1051/0004-6361/201218864